Hybrid (Φ,Ψ, ρ, ζ, θ)−invexity frameworks and efficiency conditions for multiobjective fractional programming problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized hybrid B − ( b , ρ , θ , p̃ , r̃ ) − invexities and efficiency conditions for multiobjective fractional programming

This communication deals with first introducing the exponential type hybrid B − (b, ρ, θ, p̃, r̃)invexities and then establishing a class of the ε− efficiency conditions applying to multiobjective fractional programming problems. The exponential type hybrid B − (b, ρ, θ, p̃, r̃)-invexities encompass most of the existing generalized higher order invexities as well as the exponential type generalized...

متن کامل

Multiobjective Fractional Programming Problems and Second Order Generalized Hybrid Invexity Frameworks

In this paper, the parametrically generalized sufficient efficiency conditions for multiobjective fractional programming based on the hybrid (Φ, ρ, η, ζ, θ)−invexities are developed, and then efficient solutions to the multiobjective fractional programming problems are established. Furthermore, the obtained results on sufficient efficiency conditions are generalized to the case of the ε−efficie...

متن کامل

New optimality conditions for multiobjective fuzzy programming problems

In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables.  Based on a new $p$-dimensional fuzzy stationary-point definition,  necessary  efficiency conditions are obtained.  And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

Dinkelbach Approach for Solving Interval-valued Multiobjective Fractional Programming Problems using Goal Programming

This paper presents an interval valued goal programming approach for solving multiobjective fractional programming problems. In the model formulation of the problem, the interval-valued system constraints are converted in to equivalent crisp system. The interval valued fractional objective goals are transformed into linear goals by employing the iterative parametric method which is an extension...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cubo (Temuco)

سال: 2015

ISSN: 0719-0646

DOI: 10.4067/s0719-06462015000100004